Delay Bounds for Multiclass FIFO
نویسندگان
چکیده
FIFO is perhaps the simplest scheduling discipline. For single-class FIFO, its delay guarantee performance has been extensively studied: The well-known results include a stochastic delay bound for GI/GI/1 by Kingman [2] and a deterministic delay bound for D/D/1 by Cruz [3]. However, for multiclass FIFO, few such results are available. To fill the gap, we prove delay bounds for multiclass FIFO in this work, considering both deterministic and stochastic cases. Specifically, delay bounds are presented for D/D/1, G/D/1, GI/D/1, and GI/GI/1, all under multiclass FIFO.
منابع مشابه
Performance Bounds for Multiclass FIFO in Communication Networks: A Deterministic Case
Multiclass FIFO is used in communication networks such as in input-queueing routers/switches and in wireless networks. For the concern of providing service guarantees in such networks, it is crucial to have analytical results, e.g. bounds, on the performance of multi-class FIFO. Surprisingly, there are few such results in the literature. This paper is devoted to filling the gap. Specifically, a...
متن کاملRobust Box Bounds: Throughput Guarantees for Closed Multiclass Queueing Networks with Minimal Stochastic Assumptions
To use queueing theory to analyze real systems such as computer communications networks, we make assumptions that are strictly speaking untrue. The problem is especially severe for multiclass networks with FIFO service and greatly diiering service times. This paper provides an exact analysis for bounds, for cases with greatly relaxed assumptions. Service times can have general (IFR) distributio...
متن کامل"Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes
We consider end-to-end delay bounds in a network of Guaranteed Rate (GR) nodes. We demonstrate that, contrary to what is generally believed, the existing end-to-end delay bounds apply only to GR nodes that are FIFO per flow. We show this by exhibiting a counter-example. Then we show that the proof of the existing bounds has a subtle, but important, dependency on the FIFO assumption, which was n...
متن کاملA methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
In this paper we address the problem of finding end-to-end delay bounds for single leaky-bucket shaped flows subject to FIFO multiplexing in tandems of rate-latency nodes. More specifically, we focus on a methodology, called the Least Upper Delay Bound (LUDB) method, which is based on Network Calculus. The latter has already been used for computing delay bounds in tandems in which the path of t...
متن کاملEnd-to-End Worst-Case Analysis of Non-FIFO Systems
In this report, delay bounds in data flow systems with nonFIFO service disciplines are explored. It is shown that conventional network calculus definitions of a service curve are not satisfying under the assumption of non-FIFO service. Either the definition is too strict to allow for a concatenation and consequent beneficial end-to-end analysis, or it is too loose and thus results in infinite d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1605.05753 شماره
صفحات -
تاریخ انتشار 2016